K-regular graph
英 [keɪ ˈreɡjələ(r) ɡræf]
美 [keɪ ˈreɡjələr ɡræf]
网络 k-正则图; 正则图; K正则图
双语例句
- A k-regular spanning subgraph of graph G is called a k-factor of G.
图G的一个k正则支撑子图称为G的k因子。 - The Extendability of K-regular Graph
k-正则图的可扩性质 - Let G be an ( k-1)-edge connected and k-regular simple graph, and F is an edge set of G with| F| ≤ k-1.In this paper, we prove that G-F has complete matching if G has a complete matching.
设G是k正则（k-1）-边连通的简单图，F是G的一个边集且F≤k-1。本文证明了如下结论：如果G有完美匹配，则G-F也有完美匹配。 - A k-factor of graph G is a k-regular spanning subgraph of G. A graph G Is k-covered if each edge of G belongs to a k-factor.
图G的k-正则生成子图称为G的一个k-因子，若图G的每条边都含于G的一个k-因子中，称图G足k-覆盖的。 - The manifold structure of the image data is first represented with a close-loop k-regular graph model.
首先，利用闭环k正则图模型来模拟图像数据的流形结构。